Self-Organizing Migrating Algorithm with narrowing search space strategy for robot path planning

نویسندگان

چکیده

This article introduces a version of the Self-Organizing Migrating Algorithm with narrowing search space strategy named iSOMA. Compared to previous two versions, SOMA T3A and Pareto that ranked 3rd 5th respectively in IEEE CEC (Congress on Evolutionary Computation) 2019 competition, iSOMA is equipped more advanced features notable improvements including applying jumps order, immediate update, instead searching intersecting edges hyperplanes, partial replacement individuals population when global best improved no further. Moreover, proposed algorithm organized into processes initialization, self-organizing, migrating, replacement. We tested performance this new by using three benchmark test suites 2013, 2015, 2017, which, together contain total 73 functions. Not only it superior other SOMAs, but also yields promising results against representatives well-known algorithmic families such as Differential Evolution Particle Swarm Optimization. we demonstrate application for path planning drone, while avoiding static obstacles catching target.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

Multi-Directional Search with Goal Switching for Robot Path Planning

We present a parallel path planning method that is able to automatically handle multiple goal configurations as input. There are two basic approaches, goal switching and bidirectional search, which are combined in the end. Goal switching dynamically selects a favourite goal depending on some distance function. The bi-directional search supports the backward search direction from the goal to the...

متن کامل

An Algorithm for Robot Path Planning with Cellular Automata

The application of Cellular Automata to the problem of robot path planning is presented. It is shown that a Cellular Automata allows the efficient computation of an optimal collision free path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace for a mobile robot. The path computation is performe...

متن کامل

Reasoning on the Self-Organizing Incremental Associative Memory for Online Robot Path Planning

Robot path-planning is one of the important issues in robotic navigation. This paper presents a novel robot path-planning approach based on the associative memory using Self-Organizing Incremental Neural Networks (SOINN). By the proposed method, an environment is first autonomously divided into a set of path-fragments by junctions. Each fragment is represented by a sequence of preliminarily gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2022

ISSN: ['1568-4946', '1872-9681']

DOI: https://doi.org/10.1016/j.asoc.2021.108270